VLISP Byte Code Interpreter
نویسندگان
چکیده
The Veri ed Programming Language Implementation project has developed a formally veri ed implementation of the Scheme programming language. This report documents the byte-code interpreter, which executes a user program presented in the form of a binary image. It speci es several intermediate abstract machines, and proves that they are (successive) faithful implementations of the Vlisp operational semantics. Garbage collection and the niteness of computer memories are among the issues handled.
منابع مشابه
{78 () the Vlisp Veriied Scheme System *
The vlisp project has produced a rigorously veriied compiler from Scheme to byte codes, and a veriied interpreter for the resulting byte codes. The oocial denotational semantics for Scheme provides the main criterion of correctness. The Wand-Clinger technique was used to prove correctness of the primary compiler step. Then a state machine operational semantics is proved to be faithful to the de...
متن کاملA B model for ensuring soundness of a large subset of the Java Card virtual machine
Java Cards are a new generation of smart cards that use the Java programming language. As smart cards are usually used to supply security to a system, security requirements are very strong and certification can become a competitive advantage. Such a certification to a high Common Criteria or ITSEC level requires the proof of all the security mechanisms. Those security mechanisms include the byt...
متن کاملOCamlJIT 2.0 - Faster Objective Caml
This paper presents the current state of an ongoing research project to improve the performance of theOCaml byte-code interpreter using Just-In-Time native code generation. Our JIT engine OCamlJit2 currently runs on x86-64 processors, mimicing precisely the behavior of the OCaml virtual machine. Its design and implementation is described, and performance measures are given.
متن کاملPrincipled Dynamic Code Improvement
A method for dynamically updating running code is described. The method is "principled" in that old functionality is not destroyed. Rather, new functionality is added which can selectively and dynamically change the overall behavior of the system, yet all formal properties of the original system are guaranteed to still hold. Higher-order functions are the key to making this work, and an impleme...
متن کاملAutomatically Exploiting Implicit Parallelism in Multi-way Recursive Methods in Java
In this paper we show how implicit parallelism in multi-way recursive methods, typically used to implement tree traversal or divide-and-conquer algorithms, can be made explicit by a restructuring compiler using the multi-threading mechanism of Java. Expressing parallelism in Java itself clearly has the advantage that the transformed program remains portable. After compilation of the transformed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992